منابع مشابه
Castelnuovo-Mumford regularity of products of monomial ideals
Let $R=k[x_1,x_2,cdots, x_N]$ be a polynomial ring over a field $k$. We prove that for any positive integers $m, n$, $text{reg}(I^mJ^nK)leq mtext{reg}(I)+ntext{reg}(J)+text{reg}(K)$ if $I, J, Ksubseteq R$ are three monomial complete intersections ($I$, $J$, $K$ are not necessarily proper ideals of the polynomial ring $R$), and $I, J$ are of the form $(x_{i_1}^{a_1}, x_{i_2}^{a_2}, cdots, x_{i_l...
متن کاملcastelnuovo-mumford regularity of products of monomial ideals
let $r=k[x_1,x_2,cdots, x_n]$ be a polynomial ring over a field $k$. we prove that for any positive integers $m, n$, $text{reg}(i^mj^nk)leq mtext{reg}(i)+ntext{reg}(j)+text{reg}(k)$ if $i, j, ksubseteq r$ are three monomial complete intersections ($i$, $j$, $k$ are not necessarily proper ideals of the polynomial ring $r$), and $i, j$ are of the form $(x_{i_1}^{a_1}, x_{i_2}^{a_2}, cdots, x_{i_l...
متن کاملIntersections of Leray complexes and regularity of monomial ideals
For a simplicial complex X and a field K, let h̃i(X) = dim H̃i(X;K). It is shown that if X,Y are complexes on the same vertex set, then for k ≥ 0 h̃k−1(X ∩ Y ) ≤ ∑
متن کاملHypergraphs and Regularity of Square-Free monomial ideals
We define a new combinatorial object, which we call a labeled hypergraph, uniquely associated to any square-free monomial ideal. We prove several upper bounds on the regularity of a square-free monomial ideal in terms of simple combinatorial properties of its labeled hypergraph. We also give specific formulas for the regularity of square-free monomial ideals with certain labeled hypergraphs. Fu...
متن کاملMonomial Ideals
Monomial ideals form an important link between commutative algebra and combinatorics. In this chapter, we demonstrate how to implement algorithms in Macaulay 2 for studying and using monomial ideals. We illustrate these methods with examples from combinatorics, integer programming, and algebraic geometry.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2021
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2020.105307